Tree decomposition - PDFSEARCH.IO - Document Search Engine

Tree decomposition
Results: 411

#	Item
111	9 On the Power of Belief Propagation: A Constraint Propagation Perspective R. D ECHTER , B. B IDYUK , R. M ATEESCU Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2012-01-25 15:39:31 Local consistency Probability theory Bayesian statistics Statistical models Belief propagation Bayesian network Tree decomposition Constraint satisfaction problem Flow network Graph theory Constraint programming Graphical models
112	Representative Families: A Unified Tradeoff-Based Approach Hadas Shachnai and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {hadas,meizeh}@cs.technion.ac.il Abstract. Let M = (E, I) be a mat Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-04-27 19:17:21 Dominating set Polynomials Randomized algorithm Dynamic programming Sheaf Push-relabel maximum flow algorithm Tree decomposition Mathematics Theoretical computer science Applied mathematics
113	Discrete Mathematics–252 www.elsevier.com/locate/disc Forbidden minors to graphs with small feedback sets Michael J. Dinneena;∗ , Kevin Cattellb , Michael R. Fellowsb Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:07:31 Tree decomposition Robertson–Seymour theorem Minor Planar graphs Feedback vertex set Forbidden graph characterization Permutation graph Tree Graph Graph theory Graph operations Path decomposition
114	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science
115	When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian1 , Petr Hlinˇen´ y2 , Jaroslav Neˇsetˇril3 , Jan Obdrˇz´alek2 , Patrice Ossona de Mendez4 , and Reshma Ramadurai2 1 Add to Reading List Source URL: www.fi.muni.cz Language: English - Date: 2012-06-17 02:27:41 NP-complete problems Cograph Tree decomposition Clique Graph Tree Minor Cycle rank Path decomposition Graph theory Graph operations Graph coloring
116	Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Guy E. Blelloch Anupam Gupta Ioannis Koutis† Gary L. Miller Richard Peng Kanat Tangwongsan Carnegie Mellon University and † Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-31 22:48:01 Spanning tree Network flow Graph connectivity Maximum flow problem Randomized algorithm Minimum spanning tree Connectivity Cut SL Theoretical computer science Graph theory Mathematics
117	Parameterized Algorithms for Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {hadas,meizeh}@cs.technion.ac.il Abstract. We study a broad class of Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:35:59 NP-complete problems Combinatorial optimization Dynamic programming Mathematical optimization Operations research Optimal control Connectivity Tree decomposition Parameterized complexity Theoretical computer science Graph theory Mathematics
118	Pebbles in Motion Polynomial Algorithms for Multi-Agent Path Planning Problems Supervisor: Author: Add to Reading List Source URL: ai.cs.unibas.ch Language: English - Date: 2013-01-07 17:29:29 Automated planning and scheduling Pebble motion problems Tree decomposition Algorithm Graph pebbling Graph coloring Graph theory Mathematics Theoretical computer science
119	0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 Add to Reading List Source URL: mrfellows.net Language: English - Date: 2009-09-08 08:50:37 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Feedback vertex set Vertex cover Tree decomposition Theoretical computer science Graph theory Computational complexity theory
120	CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Network theory Routing algorithms Planar separator theorem Shortest path problem Distance Induced path Tree NP-complete problems Path decomposition Graph theory Mathematics Theoretical computer science

UPDATE